Efficient scan mask techniques for connected components labeling algorithm

Efficient scan mask techniques for connected components labeling algorithm

Block-based connected components labeling is by far the fastest algorithm to label the connected components in 2D binary images, especially when the image size is quite large. This algorithm produces a decision tree that contains 211 leaf nodes with 14 levels for the depth of a tree and an average depth of 1.5923. This article attempts to provide a faster method for connected components labelin...

A Simple and Efficient Connected Components Labeling Algorithm

We describe a two-scan algorithm for labeling connected components in binary images in raster format. Unlike the classical two-scan approach, our algorithm processes equivalences during the first scan by merging equivalence classes as soon as a new equivalence is found. We show that this significantly improves the efficiency of the labeling process with respect to the classical approach. The da...

Connected components labeling - algorithms in

A space-efficient algorithm for finding strongly connected components

Tarjan’s algorihm for finding the strongly connected components of a directed graph is widely used and acclaimed. His original algorithm required at most v(2 + 5w) bits of storage, where w is the machine’s word size, whilst Nuutila and Soisalon-Soininen reduced this to v(1 + 4w). Many real world applications routinely operate on very large graphs where the storage requirements of such algorithm...

Efficient algorithm for obtaining connected components in bi-level images

We propose an efficient method for labeling connected components in bi-level images. The proposed algorithm uses a Deterministic Finite Automaton to obtain chain codes and label component boundaries, and use a tracing technique that is simpler than existing methods. Experiments on various types of images show that the proposed method improves contour tracing efficiency.